The Dilemma of Slot Concentration at Network Hubs
نویسنده
چکیده
A number of the worlds’ major airports have a high proportion of their capacity utilised by a single airline, or alliance of airlines. At major US airports, for example, it is common for the leading carrier to account for threequarters or more of the flights; at European airports the proportions are generally smaller but often exceed 50 per cent (see Annex 1). This has lead to concerns that such high levels of capacity utilisation (‘slot concentration’) will impact adversely on competition and prices and, in turn, has inclined policy makers and regulatory bodies towards pro-active competition measures. In the US, for example, the General Accounting Office (GAO, 1996) judged that the buy-sell market in slots established at certain US airports in 1985, had failed because it was argued to have done little to reduce slot concentration and introduce competition into the market. It went on to recommend that slots should be re-distributed. In Europe, the current slot allocation regulation (Regulation 95/93, Article 10) requires that at slot co-ordinated airports preference be given to new entrant carriers in the allocation of unused, returned or new slots (that together constitute the slot pool); there is also a reluctance on the part of the European Commission to accept unrestricted slot trading because of the fear that it will reinforce dominant positions; and approval of proposed alliances between carriers has often been accompanied by conditions requiring slot divestiture.
منابع مشابه
Complete / Incomplete Hierarchical Hub Center Single Assignment Network Problem
In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs. The second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete net...
متن کاملCircularly Polarized Circular Slot Antenna Array Using Sequentially Rotated Feed Network
This paper presents the design, simulation, and measurement of two low-cost broadband circularly polarized (CP) printed antennas: a single element and an array at C band. The proposed single element antenna is excited by an L-shaped strip with a tapered end, located along the circular-slot diagonal line in the back plane. From the array experimental results, the 3 dB axial ratio bandwidth can r...
متن کاملCapacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search
The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...
متن کاملA Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کاملA Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities
In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are in...
متن کامل